Heuristics for the strip packing problem with unloading constraints
نویسندگان
چکیده
منابع مشابه
Heuristics for the strip packing problem with unloading constraints
This article addresses the Strip Packing Problem with Unloading Constraints (SPU). In this problem, we are given a strip of fixed width and unbounded height, and n items of C different classes. As in the well-known two-dimensional Strip Packing problem, we have to pack all items minimizing the used height, but now we have the additional constraint that items of higher classes cannot block the w...
متن کاملTwo Dimensional Strip Packing with Unloading Constraints
In this paper we present approximation algorithms for the two dimensional strip packing problem with unloading constraints. In this problem, we are given a strip S of width 1 and unbounded height, and n items of C different classes, each item ai with height h(ai), width w(ai) and class c(ai). As in the strip packing problem, we have to pack all items minimizing the used height, but now we have ...
متن کاملAn Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
This paper describes a branch-and-cut algorithm for solving a two-dimensional orthogonal packing problem with unloading constraints, which often occurs as a subproblem of mixed vehicle routing and loading problems. At each node of the branching tree, cuts are generated to find a feasible integer solution to a one-dimensional contiguous bin packing problem. If an integer solution is obtained, an...
متن کاملReactive GRASP for the strip-packing problem
This paper presents a greedy randomized adaptive search procedure (GRASP) for the strip packing problem, which is the problem of placing a set of rectangular pieces into a strip of a given width and infinite length so as to minimize the required length. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform ex...
متن کاملHeuristics for the Rectangle Packing Problem
In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4-heuristic for the pallet loading problem. In addition to the general RPP we take also into account further restrictions which are o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2013
ISSN: 0305-0548
DOI: 10.1016/j.cor.2012.11.003